Asymptotic structure and singularities in constrained directed graphs

نویسندگان

  • David Aristoff
  • Lingjiong Zhu
چکیده

We study the asymptotics of large directed graphs, constrained to have certain densities of edges and/or outward p-stars. Our models are close cousins of exponential random graph models, in which edges and certain other subgraph densities are controlled by parameters. We find that large graphs have either uniform or bipodal structure. When edge density (resp. p-star density) is fixed and p-star density (resp. edge density) is controlled by a parameter, we find phase transitions corresponding to a change from uniform to bipodal structure. When both edge and p-star density are fixed, we find only bipodal structures and no phase transition. c ⃝ 2015 Elsevier B.V. All rights reserved. MSC: 05C80; 82B26; 05C35

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Superlinearly convergent exact penalty projected structured Hessian updating schemes for constrained nonlinear least squares: asymptotic analysis

We present a structured algorithm for solving constrained nonlinear least squares problems, and establish its local two-step Q-superlinear convergence. The approach is based on an adaptive structured scheme due to Mahdavi-Amiri and Bartels of the exact penalty method of Coleman and Conn for nonlinearly constrained optimization problems. The structured adaptation also makes use of the ideas of N...

متن کامل

Infinite product representation of solution of indefinite SturmLiouville problem

In this paper, we investigate infinite product representation of the solution of a Sturm- Liouville equation with an indefinite weight function which has two zeros and/or singularities in a finite interval. First, by using of the asymptotic estimates provided in [W. Eberhard, G. Freiling, K. Wilcken-Stoeber, Indefinite eigenvalue problems with several singular points and turning points, Math. N...

متن کامل

Feynman diagrams and polylogarithms: shuffles and pentagons

There is a universal combinatorial Hopf algebra structure hidden in the process of renormalization [ 1, 2, 3, 4, 5, 6]. The universality of this structure can be conveniently understood if one considers the UV singularities of Feynman graphs from the viewpoint of configuration spaces. Then, the combinatorial structure of renormalization can be summarized as follows. Each Feynman diagram has var...

متن کامل

Independent domination in directed graphs

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...

متن کامل

On independent domination numbers of grid and toroidal grid directed graphs

A subset $S$ of vertex set $V(D)$ is an {em indpendent dominating set} of $D$ if $S$ is both an independent and a dominating set of $D$. The {em indpendent domination number}, $i(D)$ is the cardinality of the smallest independent dominating set of $D$. In this paper we calculate the independent domination number of the { em cartesian product} of two {em directed paths} $P_m$ and $P_n$ for arbi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015